Towards a Verified Enumeration of All Tame Plane Graphs
نویسندگان
چکیده
We contribute to the fully formal verification of Hales’ proof of the Kepler Conjecure by analyzing the enumeration of all tame plane graphs. We sketch a formalization of plane graphs, tameness and Hales’ enumeration procedure in Higher Order Logic. The correctness of the enumeration is partially verified (which uncovered a small mismatch between Hales’ definition of tameness and his enumeration procedure). By executing the enumeration in ML we confirm that a list of plane graphs provided by Hales (the archive) contains all tame plane graphs (although it also contains much redundancy).
منابع مشابه
Tame Plane Graphs
These theories present the verified enumeration of tame plane graphs as defined by Thomas C. Hales in his revised proof of the Kepler Conjecture. Compared with his original proof, the notion of tameness has become simpler, there are many more tame graphs, but much of the earlier verification [1] carries over. For more details see http:// code.google.com/p/flyspeck/ and the forthcoming book “Den...
متن کاملFormalizing plane graph theory: towards a formalized proof of the Kepler conjecture
In 1998, Thomas Hales published a proof of the Kepler Conjecture, which states that the cubic close packing is the densest possible packing of equallysized spheres. The proof is by exhaustion on a set of 3050 plane graphs satisfying certain properties, called tame plane graphs. The enumeration of this set has been generated by a computer program, hence the completeness of this enumeration is es...
متن کاملFlyspeck I: Tame Graphs
We present a verified enumeration of tame graphs as defined in Hales’ proof of the Kepler Conjecture and confirm the completeness of Hales’ list of all tame graphs while reducing it from 5128 to 2771 graphs.
متن کاملVerified Efficient Enumeration of Plane Graphs Modulo Isomorphism
Due to a recent revision of Hales’s proof of the Kepler Conjecture, the existing verification of the central graph enumeration procedure had to be revised because it now has to cope with more than 10 graphs. This resulted in a new and modular design. This paper primarily describes the reusable components of the new design: a while combinator for partial functions, a theory of worklist algorithm...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کامل